________________________________________________________________

Run Header: Complete YList Version try 5: time improvement> not all moves are calculated. Some are eleminated because they cannot be the maximum of the iteration

Run start:        21.01.2010 14:36:56
Input Data from:  dataset30.txt
Iteration limit:  500
NI iter. limit:   50000

# of Customers  :60
# of Locations  :30
Ex.Facilities   :2
Total budget    :15000
Terror. attacks :2

Penalty Weight : 0,5
Update Policy  : 1-2 of last 10
pw inc. step   : 0,05

Coverage Ratio :0,154444444444444
Average f[i]   :3266,66666666667
Average g[i,j] :1171,42857142857
Total demand   :3170
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 29
> Selected Move:	440	1	-1	3	3500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 440


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 84
> Selected Move:	870	1	-1	4	6500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 870


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 45
> Selected Move:	1260	1	-1	5	11000


> New Y[]: 
	
	 2  3  0  1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 1260


> New S[]: 
	
	 0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 76
> Selected Move:	1640	1	-1	12	13500


> New Y[]: 
	
	 2  3  0  1  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 1640


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 44
> Selected Move:	1710	3	1	10	14500


> New Y[]: 
	
	 2  0  0  1  1  1  0  0  0  0  3  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 1710


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 52
> Selected Move:	1820	3	4	16	15000


> New Y[]: 
	
	 2  0  0  1  0  1  0  0  0  0  3  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 1820


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 53
> Selected Move:	1820	4	10	5	14600


> New Y[]: 
	
	 2  0  0  1  0  3  0  0  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,45

## ITERATION 7 #######################


> Neighbours evaluated; 84
> Selected Move:	1820	3	5	24	14500


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 Penalty weight for next iteration :0,4

## ITERATION 8 #######################


> Neighbours evaluated; 75
> Selected Move:	1860	3	10	11	13000


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  0  0  1  1  0  0  0  1  0  0  0  0  0  0  0  3  0  0  0  0  0    >new incumb.: 1860


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0 
 Penalty weight for next iteration :0,35

## ITERATION 9 #######################


> Neighbours evaluated; 62
> Selected Move:	1910	3	12	9	13500


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0  0  0  3  0  0  0  0  0    >new incumb.: 1910


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,3

## ITERATION 10 #######################


> Neighbours evaluated; 96
> Selected Move:	1930	3	3	8	13000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  1  0  1  0  0  0  0  1  0  0  0  0  0  0  0  3  0  0  0  0  0    >new incumb.: 1930


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 Penalty weight for next iteration :0,25

## ITERATION 11 #######################


> Neighbours evaluated; 100
> Selected Move:	1955	1	-1	12	15500


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  1  0  1  1  0  0  0  1  0  0  0  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 Penalty weight for next iteration :0,2

## ITERATION 12 #######################


> Neighbours evaluated; 74
> Selected Move:	2090	3	9	25	15000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  1  0  0  0  0  0  0  0  3  1  0  0  0  0    >new incumb.: 2090


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 Penalty weight for next iteration :0,15

## ITERATION 13 #######################


> Neighbours evaluated; 109
> Selected Move:	2075	3	25	18	15500


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  1  0  1  0  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,2

## ITERATION 14 #######################


> Neighbours evaluated; 75
> Selected Move:	2050	3	18	19	15000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  1  0  0  1  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,25

## ITERATION 15 #######################


> Neighbours evaluated; 91
> Selected Move:	2020	3	16	3	15000


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  1  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,3

## ITERATION 16 #######################


> Neighbours evaluated; 72
> Selected Move:	2000	3	3	4	14500


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  1  1  0  0  0  0  0  0  1  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,35

## ITERATION 17 #######################


> Neighbours evaluated; 101
> Selected Move:	2080	3	24	16	14800


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  1  1  0  0  0  3  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,4

## ITERATION 18 #######################


> Neighbours evaluated; 61
> Selected Move:	2070	3	19	25	14800


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  1  1  0  0  0  3  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,45

## ITERATION 19 #######################


> Neighbours evaluated; 61
> Selected Move:	2050	3	16	22	14800


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  3  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,5

## ITERATION 20 #######################


> Neighbours evaluated; 74
> Selected Move:	2030	3	25	19	14800


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  1  1  0  0  0  0  0  0  1  0  0  3  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,55

## ITERATION 21 #######################


> Neighbours evaluated; 66
> Selected Move:	2000	3	19	15	14800


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  1  1  0  0  1  0  0  0  0  0  0  3  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,5

## ITERATION 22 #######################


> Neighbours evaluated; 72
> Selected Move:	2020	3	22	24	14500


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  1  1  0  0  1  0  0  0  0  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 Penalty weight for next iteration :0,45

## ITERATION 23 #######################


> Neighbours evaluated; 89
> Selected Move:	2050	3	15	9	15000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,4

## ITERATION 24 #######################


> Neighbours evaluated; 64
> Selected Move:	2040	3	4	18	15000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  1  0  1  1  0  0  0  0  0  1  0  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,35

## ITERATION 25 #######################


> Neighbours evaluated; 78
> Selected Move:	2060	3	24	10	15000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  1  3  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,3

## ITERATION 26 #######################


> Neighbours evaluated; 79
> Selected Move:	2040	3	10	3	15000


> New Y[]: 
	
	 2  0  0  3  0  0  0  0  1  1  0  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,25

## ITERATION 27 #######################


> Neighbours evaluated; 77
> Selected Move:	2035	3	3	17	15100


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  1  0  1  1  0  0  0  0  3  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,2

## ITERATION 28 #######################


> Neighbours evaluated; 108
> Selected Move:	2000	3	11	15	15100


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  1  0  0  1  0  0  1  0  3  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,25

## ITERATION 29 #######################


> Neighbours evaluated; 66
> Selected Move:	1945	3	18	4	15100


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  1  0  0  1  0  0  1  0  3  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,3

## ITERATION 30 #######################


> Neighbours evaluated; 65
> Selected Move:	1980	3	15	11	15100


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  1  0  1  1  0  0  0  0  3  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,35

## ITERATION 31 #######################


> Neighbours evaluated; 81
> Selected Move:	2020	3	17	10	15000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  1  3  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,4

## ITERATION 32 #######################


> Neighbours evaluated; 59
> Selected Move:	2000	3	4	19	14500


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  1  3  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,45

## ITERATION 33 #######################


> Neighbours evaluated; 105
> Selected Move:	2000	3	8	3	15000


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  1  3  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,5

## ITERATION 34 #######################


> Neighbours evaluated; 54
> Selected Move:	2000	3	3	16	15000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  3  1  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,55

## ITERATION 35 #######################


> Neighbours evaluated; 54
> Selected Move:	2000	3	10	3	15000


> New Y[]: 
	
	 2  0  0  3  0  0  0  0  0  1  0  1  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,6

## ITERATION 36 #######################


> Neighbours evaluated; 47
> Selected Move:	2010	3	9	8	15000


> New Y[]: 
	
	 2  0  0  3  0  0  0  0  1  0  0  1  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,65

## ITERATION 37 #######################


> Neighbours evaluated; 47
> Selected Move:	2000	3	8	4	15000


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  0  0  0  1  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,7

## ITERATION 38 #######################


> Neighbours evaluated; 36
> Selected Move:	2010	3	3	8	15100


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  3  0  0  1  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,75

## ITERATION 39 #######################


> Neighbours evaluated; 45
> Selected Move:	2000	3	8	24	15000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  1  1  0  0  0  1  0  0  1  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,8

## ITERATION 40 #######################


> Neighbours evaluated; 37
> Selected Move:	2000	3	16	3	15000


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  1  1  0  0  0  0  0  0  1  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 Penalty weight for next iteration :0,75

## ITERATION 41 #######################


> Neighbours evaluated; 39
> Selected Move:	2000	3	19	15	15000


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  0  1  1  0  0  1  0  0  0  0  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 Penalty weight for next iteration :0,7

## ITERATION 42 #######################


> Neighbours evaluated; 36
> Selected Move:	2000	3	3	16	15000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  1  1  0  0  1  1  0  0  0  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 Penalty weight for next iteration :0,65

## ITERATION 43 #######################


> Neighbours evaluated; 31
> Selected Move:	2020	3	11	25	15000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  3  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 Penalty weight for next iteration :0,6

## ITERATION 44 #######################


> Neighbours evaluated; 26
> Selected Move:	1990	3	4	8	15000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  3  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 Penalty weight for next iteration :0,55

## ITERATION 45 #######################


> Neighbours evaluated; 34
> Selected Move:	2010	3	15	19	15000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  1  0  0  1  0  0  0  0  3  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,5

## ITERATION 46 #######################


> Neighbours evaluated; 56
> Selected Move:	2000	3	24	5	15100


> New Y[]: 
	
	 2  0  0  0  0  3  0  0  1  0  0  0  1  0  0  0  1  0  0  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,55

## ITERATION 47 #######################


> Neighbours evaluated; 53
> Selected Move:	1965	3	5	17	15100


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  1  3  0  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,6

## ITERATION 48 #######################


> Neighbours evaluated; 53
> Selected Move:	1950	3	17	11	15000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  0  3  1  0  0  0  1  0  0  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,65

## ITERATION 49 #######################


> Neighbours evaluated; 59
> Selected Move:	1950	4	11	8	14600


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  3  0  0  1  1  0  0  0  1  0  0  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,7

## ITERATION 50 #######################


> Neighbours evaluated; 80
> Selected Move:	2000	3	19	4	15100


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  3  0  0  1  1  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,75

## ITERATION 51 #######################


> Neighbours evaluated; 42
> Selected Move:	2020	3	8	10	15000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  3  1  1  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,8

## ITERATION 52 #######################


> Neighbours evaluated; 47
> Selected Move:	1980	3	16	8	14500


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  3  1  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,85

## ITERATION 53 #######################


> Neighbours evaluated; 74
> Selected Move:	1980	3	25	18	15000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  3  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,9

## ITERATION 54 #######################


> Neighbours evaluated; 50
> Selected Move:	1980	3	4	2	15000


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  1  0  3  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,95

## ITERATION 55 #######################


> Neighbours evaluated; 23
> Selected Move:	1980	3	8	9	15000


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  0  1  3  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1

## ITERATION 56 #######################


> Neighbours evaluated; 41
> Selected Move:	1990	3	18	4	15000


> New Y[]: 
	
	 2  0  1  0  1  0  0  0  0  1  3  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1,05

## ITERATION 57 #######################


> Neighbours evaluated; 27
> Selected Move:	1990	3	10	3	15000


> New Y[]: 
	
	 2  0  1  3  1  0  0  0  0  1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1

## ITERATION 58 #######################


> Neighbours evaluated; 36
> Selected Move:	2000	3	2	8	15000


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  1  1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,95

## ITERATION 59 #######################


> Neighbours evaluated; 48
> Selected Move:	2000	3	4	19	14500


> New Y[]: 
	
	 2  0  0  3  0  0  0  0  1  1  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,9

## ITERATION 60 #######################


> Neighbours evaluated; 64
> Selected Move:	2000	3	3	16	14800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  1  0  1  1  0  0  0  3  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,85

## ITERATION 61 #######################


> Neighbours evaluated; 60
> Selected Move:	1970	3	8	4	14800


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  1  0  1  1  0  0  0  3  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,8

## ITERATION 62 #######################


> Neighbours evaluated; 55
> Selected Move:	1970	3	16	3	14500


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  0  1  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,75

## ITERATION 63 #######################


> Neighbours evaluated; 67
> Selected Move:	1970	3	3	8	14600


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  3  1  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,7

## ITERATION 64 #######################


> Neighbours evaluated; 65
> Selected Move:	1970	4	8	4	14900


> New Y[]: 
	
	 2  0  0  0  3  0  0  0  1  1  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,65

## ITERATION 65 #######################


> Neighbours evaluated; 59
> Selected Move:	1970	4	4	9	14800


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  3  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,6

## ITERATION 66 #######################


> Neighbours evaluated; 59
> Selected Move:	1970	4	9	11	15000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  1  0  3  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,55

## ITERATION 67 #######################


> Neighbours evaluated; 57
> Selected Move:	1970	3	11	3	15000


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  1  1  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,5

## ITERATION 68 #######################


> Neighbours evaluated; 54
> Selected Move:	1970	3	9	11	14500


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  1  0  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,45

## ITERATION 69 #######################


> Neighbours evaluated; 77
> Selected Move:	1970	3	12	9	15000


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  1  1  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,4

## ITERATION 70 #######################


> Neighbours evaluated; 65
> Selected Move:	1930	3	3	12	15100


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  1  0  1  3  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,35

## ITERATION 71 #######################


> Neighbours evaluated; 75
> Selected Move:	1950	3	9	25	14600


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  1  3  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,3

## ITERATION 72 #######################


> Neighbours evaluated; 94
> Selected Move:	2000	3	12	16	14800


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  1  0  0  0  0  3  0  0  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,25

## ITERATION 73 #######################


> Neighbours evaluated; 81
> Selected Move:	2040	3	11	12	14800


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  0  1  0  0  0  3  0  0  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,2

## ITERATION 74 #######################


> Neighbours evaluated; 54
> Selected Move:	2020	4	16	8	15100


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  3  0  0  0  1  0  0  0  1  0  0  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,25

## ITERATION 75 #######################


> Neighbours evaluated; 54
> Selected Move:	1975	3	12	11	15100


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  3  0  0  1  0  0  0  0  1  0  0  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,3

## ITERATION 76 #######################


> Neighbours evaluated; 80
> Selected Move:	1950	3	16	12	14100


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  3  0  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,35

## ITERATION 77 #######################


> Neighbours evaluated; 128
> Selected Move:	1960	3	19	2	14600


> New Y[]: 
	
	 2  0  1  0  1  0  0  0  3  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,4

## ITERATION 78 #######################


> Neighbours evaluated; 71
> Selected Move:	1960	4	8	2	14800


> New Y[]: 
	
	 2  0  3  0  1  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,45

## ITERATION 79 #######################


> Neighbours evaluated; 58
> Selected Move:	1970	3	2	24	14500


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  3  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,5

## ITERATION 80 #######################


> Neighbours evaluated; 87
> Selected Move:	2040	3	25	2	15000


> New Y[]: 
	
	 2  0  1  0  1  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 Penalty weight for next iteration :0,55

## ITERATION 81 #######################


> Neighbours evaluated; 37
> Selected Move:	2030	3	4	9	15000


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  1  1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 Penalty weight for next iteration :0,6

## ITERATION 82 #######################


> Neighbours evaluated; 53
> Selected Move:	1990	3	8	4	15000


> New Y[]: 
	
	 2  0  1  0  1  0  0  0  0  1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 Penalty weight for next iteration :0,65

## ITERATION 83 #######################


> Neighbours evaluated; 36
> Selected Move:	1980	3	4	18	15000


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  0  1  0  1  1  0  0  0  0  0  1  0  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 Penalty weight for next iteration :0,7

## ITERATION 84 #######################


> Neighbours evaluated; 28
> Selected Move:	1980	3	9	8	15000


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  1  0  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 Penalty weight for next iteration :0,65

## ITERATION 85 #######################


> Neighbours evaluated; 36
> Selected Move:	1950	3	2	4	15000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  1  1  0  0  0  0  0  1  0  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,6

## ITERATION 86 #######################


> Neighbours evaluated; 56
> Selected Move:	1950	3	18	29	15000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  3  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,55

## ITERATION 87 #######################


> Neighbours evaluated; 72
> Selected Move:	1910	3	29	13	14500


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  1  1  1  0  0  0  0  0  0  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,5

## ITERATION 88 #######################


> Neighbours evaluated; 88
> Selected Move:	1930	3	4	16	15000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  0  1  1  1  0  0  1  0  0  0  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 Penalty weight for next iteration :0,45

## ITERATION 89 #######################


> Neighbours evaluated; 43
> Selected Move:	1960	3	11	25	15000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  0  0  1  1  0  0  1  0  0  0  0  0  0  0  3  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 Penalty weight for next iteration :0,4

## ITERATION 90 #######################


> Neighbours evaluated; 43
> Selected Move:	1940	3	13	4	15500


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  3  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0 
 Penalty weight for next iteration :0,35

## ITERATION 91 #######################


> Neighbours evaluated; 29
> Selected Move:	2010	3	16	2	15000


> New Y[]: 
	
	 2  0  1  0  1  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  3  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 Penalty weight for next iteration :0,3

## ITERATION 92 #######################


> Neighbours evaluated; 38
> Selected Move:	1990	3	2	15	14500


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  3  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 Penalty weight for next iteration :0,25

## ITERATION 93 #######################


> Neighbours evaluated; 83
> Selected Move:	1980	3	24	16	14800


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  0  1  0  0  1  3  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 Penalty weight for next iteration :0,2

## ITERATION 94 #######################


> Neighbours evaluated; 55
> Selected Move:	1960	4	16	8	15100


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  3  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 Penalty weight for next iteration :0,25

## ITERATION 95 #######################


> Neighbours evaluated; 46
> Selected Move:	1930	3	8	10	15000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  3  0  1  0  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,3

## ITERATION 96 #######################


> Neighbours evaluated; 78
> Selected Move:	1950	3	4	18	15000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  3  0  1  0  0  1  1  0  1  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,35

## ITERATION 97 #######################


> Neighbours evaluated; 79
> Selected Move:	1940	3	15	11	15000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  3  1  1  0  0  0  1  0  1  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,4

## ITERATION 98 #######################


> Neighbours evaluated; 95
> Selected Move:	1960	3	18	2	15000


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  0  0  3  1  1  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,45

## ITERATION 99 #######################


> Neighbours evaluated; 65
> Selected Move:	1960	3	2	8	15000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  3  1  1  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,5

## ITERATION 100 #######################


> Neighbours evaluated; 67
> Selected Move:	1940	3	10	20	15000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  1  0  0  0  3  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,45

## ITERATION 101 #######################


> Neighbours evaluated; 84
> Selected Move:	1925	3	20	17	15100


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  1  3  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,5

## ITERATION 102 #######################


> Neighbours evaluated; 68
> Selected Move:	1930	3	16	4	14600


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  1  1  0  0  0  0  3  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,55

## ITERATION 103 #######################


> Neighbours evaluated; 91
> Selected Move:	1950	3	17	19	14900


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  1  1  0  0  0  0  0  0  3  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,6

## ITERATION 104 #######################


> Neighbours evaluated; 54
> Selected Move:	1950	4	19	4	14400


> New Y[]: 
	
	 2  0  0  0  3  0  0  0  1  0  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,55

## ITERATION 105 #######################


> Neighbours evaluated; 80
> Selected Move:	1960	3	19	2	14900


> New Y[]: 
	
	 2  0  1  0  3  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,5

## ITERATION 106 #######################


> Neighbours evaluated; 54
> Selected Move:	1960	4	4	11	15000


> New Y[]: 
	
	 2  0  1  0  1  0  0  0  1  0  0  3  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,45

## ITERATION 107 #######################


> Neighbours evaluated; 40
> Selected Move:	1950	3	2	19	14500


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  3  1  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,4

## ITERATION 108 #######################


> Neighbours evaluated; 84
> Selected Move:	1990	3	11	22	14800


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  0  1  0  0  0  0  0  0  1  0  0  3  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,35

## ITERATION 109 #######################


> Neighbours evaluated; 64
> Selected Move:	1940	3	4	11	14300


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  1  0  0  3  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,3

## ITERATION 110 #######################


> Neighbours evaluated; 92
> Selected Move:	1960	3	19	16	15300


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  1  0  0  0  0  0  3  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,35

## ITERATION 111 #######################


> Neighbours evaluated; 62
> Selected Move:	1945	3	8	4	15300


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  1  1  0  0  0  1  0  0  0  0  0  3  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,4

## ITERATION 112 #######################


> Neighbours evaluated; 50
> Selected Move:	1970	3	22	24	15000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  1  1  0  0  0  1  0  0  0  0  0  0  0  3  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,45

## ITERATION 113 #######################


> Neighbours evaluated; 70
> Selected Move:	1960	3	24	1	14000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  1  1  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,5

## ITERATION 114 #######################


> Neighbours evaluated; 112
> Selected Move:	1990	3	25	3	15000


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  0  0  1  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,55

## ITERATION 115 #######################


> Neighbours evaluated; 38
> Selected Move:	1990	3	3	9	14500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  0  1  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,6

## ITERATION 116 #######################


> Neighbours evaluated; 62
> Selected Move:	1990	3	4	3	15000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  1  0  1  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,65

## ITERATION 117 #######################


> Neighbours evaluated; 42
> Selected Move:	1990	3	16	4	14500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,7

## ITERATION 118 #######################


> Neighbours evaluated; 54
> Selected Move:	1990	3	3	17	15000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  1  0  1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,75

## ITERATION 119 #######################


> Neighbours evaluated; 47
> Selected Move:	1950	3	4	18	15000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  1  1  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,8

## ITERATION 120 #######################


> Neighbours evaluated; 46
> Selected Move:	1980	3	17	16	14500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  1  1  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,75

## ITERATION 121 #######################


> Neighbours evaluated; 64
> Selected Move:	1980	3	18	8	14500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  0  1  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,7

## ITERATION 122 #######################


> Neighbours evaluated; 68
> Selected Move:	1950	3	8	19	14000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  1  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,65

## ITERATION 123 #######################


> Neighbours evaluated; 84
> Selected Move:	2030	3	0	3	15000


> New Y[]: 
	
	 0  3  0  2  0  0  0  0  0  1  0  1  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,6

## ITERATION 124 #######################


> Neighbours evaluated; 43
> Selected Move:	2030	4	3	16	15000


> New Y[]: 
	
	 0  3  0  1  0  0  0  0  0  1  0  1  1  0  0  0  2  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,55

## ITERATION 125 #######################


> Neighbours evaluated; 43
> Selected Move:	2030	3	3	4	14500


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  1  0  1  1  0  0  0  2  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,5

## ITERATION 126 #######################


> Neighbours evaluated; 58
> Selected Move:	2030	4	16	4	15000


> New Y[]: 
	
	 0  3  0  0  2  0  0  0  0  1  0  1  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,45

## ITERATION 127 #######################


> Neighbours evaluated; 44
> Selected Move:	1990	3	16	3	15000


> New Y[]: 
	
	 0  3  0  1  2  0  0  0  0  1  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,4

## ITERATION 128 #######################


> Neighbours evaluated; 59
> Selected Move:	1990	4	4	3	14500


> New Y[]: 
	
	 0  3  0  2  1  0  0  0  0  1  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,35

## ITERATION 129 #######################


> Neighbours evaluated; 80
> Selected Move:	2000	3	19	2	15000


> New Y[]: 
	
	 0  3  1  2  1  0  0  0  0  1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,3

## ITERATION 130 #######################


> Neighbours evaluated; 54
> Selected Move:	2030	3	3	16	15000


> New Y[]: 
	
	 0  3  1  0  1  0  0  0  0  1  0  1  1  0  0  0  2  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,25

## ITERATION 131 #######################


> Neighbours evaluated; 48
> Selected Move:	2030	3	4	8	15000


> New Y[]: 
	
	 0  3  1  0  0  0  0  0  1  1  0  1  1  0  0  0  2  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,2

## ITERATION 132 #######################


> Neighbours evaluated; 60
> Selected Move:	2030	3	2	19	14500


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  1  1  0  1  1  0  0  0  2  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,15

## ITERATION 133 #######################


> Neighbours evaluated; 102
> Selected Move:	2015	4	16	8	15100


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  2  1  0  1  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,1

## ITERATION 134 #######################


> Neighbours evaluated; 85
> Selected Move:	2020	4	8	9	15100


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  1  2  0  1  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,15

## ITERATION 135 #######################


> Neighbours evaluated; 71
> Selected Move:	2015	3	8	4	15100


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  2  0  1  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,2

## ITERATION 136 #######################


> Neighbours evaluated; 65
> Selected Move:	2000	3	9	22	15300


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  0  0  1  1  0  0  0  1  0  0  1  0  0  2  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,25

## ITERATION 137 #######################


> Neighbours evaluated; 59
> Selected Move:	1990	3	22	3	15000


> New Y[]: 
	
	 0  3  0  2  1  0  0  0  0  0  0  1  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,3

## ITERATION 138 #######################


> Neighbours evaluated; 49
> Selected Move:	1990	4	3	16	15000


> New Y[]: 
	
	 0  3  0  1  1  0  0  0  0  0  0  1  1  0  0  0  2  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,35

## ITERATION 139 #######################


> Neighbours evaluated; 70
> Selected Move:	1970	3	19	15	15000


> New Y[]: 
	
	 0  3  0  1  1  0  0  0  0  0  0  1  1  0  0  1  2  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,4

## ITERATION 140 #######################


> Neighbours evaluated; 44
> Selected Move:	1970	4	16	3	15000


> New Y[]: 
	
	 0  3  0  2  1  0  0  0  0  0  0  1  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,45

## ITERATION 141 #######################


> Neighbours evaluated; 47
> Selected Move:	1955	3	3	24	15100


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  0  0  1  1  0  0  1  1  0  0  0  0  0  0  0  2  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 Penalty weight for next iteration :0,5

## ITERATION 142 #######################


> Neighbours evaluated; 39
> Selected Move:	1950	3	15	19	15100


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  0  0  1  1  0  0  0  1  0  0  1  0  0  0  0  2  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,55

## ITERATION 143 #######################


> Neighbours evaluated; 42
> Selected Move:	1975	3	4	8	15100


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  1  0  0  1  1  0  0  0  1  0  0  1  0  0  0  0  2  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0 
 Penalty weight for next iteration :0,6

## ITERATION 144 #######################


> Neighbours evaluated; 41
> Selected Move:	1930	3	16	9	14600


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  1  1  0  1  1  0  0  0  0  0  0  1  0  0  0  0  2  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,65

## ITERATION 145 #######################


> Neighbours evaluated; 71
> Selected Move:	1990	3	24	22	14800


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  1  1  0  1  1  0  0  0  0  0  0  1  0  0  2  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,7

## ITERATION 146 #######################


> Neighbours evaluated; 46
> Selected Move:	1980	3	8	4	14800


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  1  0  1  1  0  0  0  0  0  0  1  0  0  2  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,75

## ITERATION 147 #######################


> Neighbours evaluated; 48
> Selected Move:	1940	3	22	17	14600


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  1  0  1  1  0  0  0  0  2  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,8

## ITERATION 148 #######################


> Neighbours evaluated; 68
> Selected Move:	1930	3	17	8	14600


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  2  1  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,85

## ITERATION 149 #######################


> Neighbours evaluated; 58
> Selected Move:	1930	4	8	4	14500


> New Y[]: 
	
	 0  3  0  0  2  0  0  0  1  1  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,9

## ITERATION 150 #######################


> Neighbours evaluated; 64
> Selected Move:	1940	3	19	2	15000


> New Y[]: 
	
	 0  3  1  0  2  0  0  0  1  1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,95

## ITERATION 151 #######################


> Neighbours evaluated; 46
> Selected Move:	1940	4	4	2	15000


> New Y[]: 
	
	 0  3  2  0  1  0  0  0  1  1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1

## ITERATION 152 #######################


> Neighbours evaluated; 31
> Selected Move:	2000	3	2	16	15000


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  1  1  0  1  1  0  0  0  2  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,95

## ITERATION 153 #######################


> Neighbours evaluated; 39
> Selected Move:	1980	3	16	28	15000


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  1  1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  2  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,9

## ITERATION 154 #######################


> Neighbours evaluated; 42
> Selected Move:	1940	3	4	2	15000


> New Y[]: 
	
	 0  3  1  0  0  0  0  0  1  1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  2  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,85

## ITERATION 155 #######################


> Neighbours evaluated; 48
> Selected Move:	1945	3	28	24	15100


> New Y[]: 
	
	 0  3  1  0  0  0  0  0  1  1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  2  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 Penalty weight for next iteration :0,8

## ITERATION 156 #######################


> Neighbours evaluated; 42
> Selected Move:	1970	3	8	4	15100


> New Y[]: 
	
	 0  3  1  0  1  0  0  0  0  1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  2  0  0  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,85

## ITERATION 157 #######################


> Neighbours evaluated; 39
> Selected Move:	1940	3	24	28	15000


> New Y[]: 
	
	 0  3  1  0  1  0  0  0  0  1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  2  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,9

## ITERATION 158 #######################


> Neighbours evaluated; 39
> Selected Move:	1940	3	9	8	15000


> New Y[]: 
	
	 0  3  1  0  1  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  2  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,95

## ITERATION 159 #######################


> Neighbours evaluated; 37
> Selected Move:	1940	3	28	16	15000


> New Y[]: 
	
	 0  3  1  0  1  0  0  0  1  0  0  1  1  0  0  0  2  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1

## ITERATION 160 #######################


> Neighbours evaluated; 36
> Selected Move:	1930	3	2	19	14500


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  1  0  0  1  1  0  0  0  2  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1,05

## ITERATION 161 #######################


> Neighbours evaluated; 57
> Selected Move:	1950	3	12	9	15000


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  1  1  0  1  0  0  0  0  2  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1,1

## ITERATION 162 #######################


> Neighbours evaluated; 37
> Selected Move:	1930	3	11	12	15000


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  1  1  0  0  1  0  0  0  2  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1,15

## ITERATION 163 #######################


> Neighbours evaluated; 32
> Selected Move:	1930	3	16	11	15000


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  1  1  0  2  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1,2

## ITERATION 164 #######################


> Neighbours evaluated; 39
> Selected Move:	1930	4	11	9	14600


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  1  2  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1,25

## ITERATION 165 #######################


> Neighbours evaluated; 58
> Selected Move:	1930	4	9	19	15000


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  1  1  0  1  1  0  0  0  0  0  0  2  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1,2

## ITERATION 166 #######################


> Neighbours evaluated; 39
> Selected Move:	1890	3	19	0	14000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1,15

## ITERATION 167 #######################


> Neighbours evaluated; 67
> Selected Move:	1950	3	1	7	15000


> New Y[]: 
	
	 2  0  0  0  1  0  0  3  1  1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1,1

## ITERATION 168 #######################


> Neighbours evaluated; 39
> Selected Move:	1980	3	4	18	15000


> New Y[]: 
	
	 2  0  0  0  0  0  0  3  1  1  0  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1,05

## ITERATION 169 #######################


> Neighbours evaluated; 49
> Selected Move:	1960	3	18	19	14500


> New Y[]: 
	
	 2  0  0  0  0  0  0  3  1  1  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1

## ITERATION 170 #######################


> Neighbours evaluated; 64
> Selected Move:	1970	3	7	17	14600


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  1  0  1  1  0  0  0  0  3  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,95

## ITERATION 171 #######################


> Neighbours evaluated; 67
> Selected Move:	1940	3	17	5	14600


> New Y[]: 
	
	 2  0  0  0  0  3  0  0  1  1  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,9

## ITERATION 172 #######################


> Neighbours evaluated; 71
> Selected Move:	1930	3	5	6	14900


> New Y[]: 
	
	 2  0  0  0  0  0  3  0  1  1  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,85

## ITERATION 173 #######################


> Neighbours evaluated; 55
> Selected Move:	1930	3	6	24	14500


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  1  0  1  1  0  0  0  0  0  0  1  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,8

## ITERATION 174 #######################


> Neighbours evaluated; 69
> Selected Move:	1930	3	8	3	15000


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  1  0  1  1  0  0  0  0  0  0  1  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,75

## ITERATION 175 #######################


> Neighbours evaluated; 41
> Selected Move:	1960	3	24	7	15000


> New Y[]: 
	
	 2  0  0  1  0  0  0  3  0  1  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,7

## ITERATION 176 #######################


> Neighbours evaluated; 43
> Selected Move:	1930	3	3	16	15000


> New Y[]: 
	
	 2  0  0  0  0  0  0  3  0  1  0  1  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,65

## ITERATION 177 #######################


> Neighbours evaluated; 40
> Selected Move:	1970	3	9	8	15000


> New Y[]: 
	
	 2  0  0  0  0  0  0  3  1  0  0  1  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,6

## ITERATION 178 #######################


> Neighbours evaluated; 46
> Selected Move:	1940	3	7	10	15000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  3  1  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,55

## ITERATION 179 #######################


> Neighbours evaluated; 60
> Selected Move:	1960	3	8	4	15000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  3  1  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,5

## ITERATION 180 #######################


> Neighbours evaluated; 60
> Selected Move:	2000	3	16	3	15000


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  3  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,45

## ITERATION 181 #######################


> Neighbours evaluated; 70
> Selected Move:	2000	3	19	15	15000


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  0  3  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,4

## ITERATION 182 #######################


> Neighbours evaluated; 72
> Selected Move:	1950	3	3	16	15000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  3  1  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,35

## ITERATION 183 #######################


> Neighbours evaluated; 82
> Selected Move:	2000	3	10	3	15000


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  0  0  0  1  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,3

## ITERATION 184 #######################


> Neighbours evaluated; 75
> Selected Move:	1960	3	15	25	15000


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  0  0  0  1  1  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,25

## ITERATION 185 #######################


> Neighbours evaluated; 90
> Selected Move:	1940	3	11	19	15000


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,2

## ITERATION 186 #######################


> Neighbours evaluated; 74
> Selected Move:	1950	3	3	11	15000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  3  1  0  0  0  1  0  0  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,15

## ITERATION 187 #######################


> Neighbours evaluated; 101
> Selected Move:	2005	3	25	8	15500


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  3  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,1

## ITERATION 188 #######################


> Neighbours evaluated; 104
> Selected Move:	2040	4	11	4	15400


> New Y[]: 
	
	 2  0  0  0  3  0  0  0  1  0  0  1  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,15

## ITERATION 189 #######################


> Neighbours evaluated; 86
> Selected Move:	2010	3	19	25	15400


> New Y[]: 
	
	 2  0  0  0  3  0  0  0  1  0  0  1  1  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,2

## ITERATION 190 #######################


> Neighbours evaluated; 71
> Selected Move:	1970	4	4	11	15500


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  3  1  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,25

## ITERATION 191 #######################


> Neighbours evaluated; 69
> Selected Move:	1920	4	11	12	15600


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  1  3  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,3

## ITERATION 192 #######################


> Neighbours evaluated; 55
> Selected Move:	1980	3	12	24	15500


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  3  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,35

## ITERATION 193 #######################


> Neighbours evaluated; 62
> Selected Move:	1970	3	16	2	15000


> New Y[]: 
	
	 2  0  1  0  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  3  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 Penalty weight for next iteration :0,4

## ITERATION 194 #######################


> Neighbours evaluated; 57
> Selected Move:	1940	3	4	12	14500


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  3  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,45

## ITERATION 195 #######################


> Neighbours evaluated; 76
> Selected Move:	1960	3	24	16	14800


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  1  0  0  1  1  0  0  0  3  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,5

## ITERATION 196 #######################


> Neighbours evaluated; 54
> Selected Move:	1960	3	8	4	14800


> New Y[]: 
	
	 2  0  1  0  1  0  0  0  0  0  0  1  1  0  0  0  3  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,55

## ITERATION 197 #######################


> Neighbours evaluated; 51
> Selected Move:	1960	3	16	10	14500


> New Y[]: 
	
	 2  0  1  0  1  0  0  0  0  0  3  1  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,6

## ITERATION 198 #######################


> Neighbours evaluated; 93
> Selected Move:	1960	3	25	8	15000


> New Y[]: 
	
	 2  0  1  0  1  0  0  0  1  0  3  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,65

## ITERATION 199 #######################


> Neighbours evaluated; 23
> Selected Move:	1980	3	4	9	15000


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  1  1  3  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,7

## ITERATION 200 #######################


> Neighbours evaluated; 48
> Selected Move:	1970	3	2	29	15000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  1  3  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,75

## ITERATION 201 #######################


> Neighbours evaluated; 56
> Selected Move:	1940	3	8	18	15000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  3  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,7

## ITERATION 202 #######################


> Neighbours evaluated; 48
> Selected Move:	1950	3	29	4	15000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  1  3  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,65

## ITERATION 203 #######################


> Neighbours evaluated; 46
> Selected Move:	1960	3	9	2	15000


> New Y[]: 
	
	 2  0  1  0  1  0  0  0  0  0  3  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,6

## ITERATION 204 #######################


> Neighbours evaluated; 43
> Selected Move:	1950	3	10	3	15000


> New Y[]: 
	
	 2  0  1  3  1  0  0  0  0  0  0  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,55

## ITERATION 205 #######################


> Neighbours evaluated; 47
> Selected Move:	1980	3	4	9	15000


> New Y[]: 
	
	 2  0  1  3  0  0  0  0  0  1  0  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,5

## ITERATION 206 #######################


> Neighbours evaluated; 42
> Selected Move:	1950	3	2	4	15000


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  0  1  0  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,45

## ITERATION 207 #######################


> Neighbours evaluated; 71
> Selected Move:	1930	3	4	15	14500


> New Y[]: 
	
	 2  0  0  3  0  0  0  0  0  1  0  1  1  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,4

## ITERATION 208 #######################


> Neighbours evaluated; 77
> Selected Move:	1940	3	3	8	14600


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  3  1  0  1  1  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,35

## ITERATION 209 #######################


> Neighbours evaluated; 89
> Selected Move:	1945	3	15	2	15100


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  3  1  0  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,3

## ITERATION 210 #######################


> Neighbours evaluated; 73
> Selected Move:	1960	3	18	4	15100


> New Y[]: 
	
	 2  0  1  0  1  0  0  0  3  1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,35

## ITERATION 211 #######################


> Neighbours evaluated; 44
> Selected Move:	1945	3	8	17	15100


> New Y[]: 
	
	 2  0  1  0  1  0  0  0  0  1  0  1  1  0  0  0  0  3  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,4

## ITERATION 212 #######################


> Neighbours evaluated; 50
> Selected Move:	1910	3	2	19	14600


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  1  0  1  1  0  0  0  0  3  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,45

## ITERATION 213 #######################


> Neighbours evaluated; 80
> Selected Move:	1925	3	4	16	15100


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  0  1  1  0  0  0  1  3  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,5

## ITERATION 214 #######################


> Neighbours evaluated; 51
> Selected Move:	1950	3	17	8	15100


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  3  1  0  1  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,55

## ITERATION 215 #######################


> Neighbours evaluated; 62
> Selected Move:	1945	3	16	3	15100


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  3  1  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,6

## ITERATION 216 #######################


> Neighbours evaluated; 62
> Selected Move:	1920	3	3	2	14600


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  3  1  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,65

## ITERATION 217 #######################


> Neighbours evaluated; 65
> Selected Move:	1920	4	8	2	14800


> New Y[]: 
	
	 2  0  3  0  0  0  0  0  1  1  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,7

## ITERATION 218 #######################


> Neighbours evaluated; 49
> Selected Move:	1920	4	2	9	14800


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  1  3  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,75

## ITERATION 219 #######################


> Neighbours evaluated; 58
> Selected Move:	1920	4	9	11	15000


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  1  1  0  3  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,8

## ITERATION 220 #######################


> Neighbours evaluated; 45
> Selected Move:	1900	3	9	4	15000


> New Y[]: 
	
	 2  0  1  0  1  0  0  0  1  0  0  3  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,85

## ITERATION 221 #######################


> Neighbours evaluated; 38
> Selected Move:	1900	4	11	2	14800


> New Y[]: 
	
	 2  0  3  0  1  0  0  0  1  0  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,9

## ITERATION 222 #######################


> Neighbours evaluated; 46
> Selected Move:	1960	3	2	10	14500


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  3  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,95

## ITERATION 223 #######################


> Neighbours evaluated; 57
> Selected Move:	1950	3	10	25	14800


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  3  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1

## ITERATION 224 #######################


> Neighbours evaluated; 54
> Selected Move:	1920	3	19	15	14800


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  1  1  0  0  1  0  0  0  0  0  0  0  0  0  3  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,95

## ITERATION 225 #######################


> Neighbours evaluated; 56
> Selected Move:	1940	3	25	6	14900


> New Y[]: 
	
	 2  0  0  0  1  0  3  0  1  0  0  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,9

## ITERATION 226 #######################


> Neighbours evaluated; 51
> Selected Move:	1940	3	6	9	14800


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  3  0  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,85

## ITERATION 227 #######################


> Neighbours evaluated; 59
> Selected Move:	1940	4	9	4	14900


> New Y[]: 
	
	 2  0  0  0  3  0  0  0  1  1  0  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,8

## ITERATION 228 #######################


> Neighbours evaluated; 60
> Selected Move:	1940	4	4	8	14600


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  3  1  0  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,75

## ITERATION 229 #######################


> Neighbours evaluated; 64
> Selected Move:	1940	4	8	11	15000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  1  0  3  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,7

## ITERATION 230 #######################


> Neighbours evaluated; 44
> Selected Move:	1950	3	11	24	15000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  1  0  0  1  0  0  1  0  0  0  0  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,65

## ITERATION 231 #######################


> Neighbours evaluated; 48
> Selected Move:	1920	3	4	18	15000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  1  0  0  1  0  0  1  0  0  1  0  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,6

## ITERATION 232 #######################


> Neighbours evaluated; 41
> Selected Move:	1940	3	9	11	14500


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  0  1  1  0  0  1  0  0  1  0  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 Penalty weight for next iteration :0,55

## ITERATION 233 #######################


> Neighbours evaluated; 67
> Selected Move:	1940	3	8	3	15000


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  0  0  1  1  0  0  1  0  0  1  0  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 Penalty weight for next iteration :0,5

## ITERATION 234 #######################


> Neighbours evaluated; 27
> Selected Move:	1940	3	3	16	15000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  1  1  0  0  1  1  0  1  0  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0 
 Penalty weight for next iteration :0,45

## ITERATION 235 #######################


> Neighbours evaluated; 54
> Selected Move:	1940	3	18	8	15000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  0  1  1  0  0  1  1  0  0  0  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 Penalty weight for next iteration :0,4

## ITERATION 236 #######################


> Neighbours evaluated; 53
> Selected Move:	1940	3	15	4	15500


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  1  1  0  0  0  1  0  0  0  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 Penalty weight for next iteration :0,35

## ITERATION 237 #######################


> Neighbours evaluated; 47
> Selected Move:	1930	3	24	1	14500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  0  0  1  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,3

## ITERATION 238 #######################


> Neighbours evaluated; 84
> Selected Move:	1980	3	8	20	15000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  1  1  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,25

## ITERATION 239 #######################


> Neighbours evaluated; 110
> Selected Move:	1970	3	20	19	14000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  1  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,2

## ITERATION 240 #######################


> Neighbours evaluated; 125
> Selected Move:	1970	3	1	22	15300


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  1  1  0  0  0  1  0  0  1  0  0  3  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,25

## ITERATION 241 #######################


> Neighbours evaluated; 64
> Selected Move:	1955	3	4	8	15300


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  1  0  0  1  0  0  3  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,3

## ITERATION 242 #######################


> Neighbours evaluated; 67
> Selected Move:	1950	3	22	17	15100


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  1  3  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,35

## ITERATION 243 #######################


> Neighbours evaluated; 86
> Selected Move:	1910	3	16	4	14600


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  1  1  0  0  0  0  3  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,4

## ITERATION 244 #######################


> Neighbours evaluated; 95
> Selected Move:	1920	3	19	15	14600


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  1  1  0  0  1  0  3  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,45

## ITERATION 245 #######################


> Neighbours evaluated; 94
> Selected Move:	1940	3	11	25	14600


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  0  1  0  0  1  0  3  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,5

## ITERATION 246 #######################


> Neighbours evaluated; 66
> Selected Move:	1940	3	4	18	14600


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  0  0  1  0  0  1  0  3  1  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,55

## ITERATION 247 #######################


> Neighbours evaluated; 67
> Selected Move:	1940	3	17	6	14900


> New Y[]: 
	
	 2  0  0  0  0  0  3  0  1  0  0  0  1  0  0  1  0  0  1  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,6

## ITERATION 248 #######################


> Neighbours evaluated; 51
> Selected Move:	1940	3	6	16	14800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  0  0  1  0  0  1  3  0  1  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,65

## ITERATION 249 #######################


> Neighbours evaluated; 45
> Selected Move:	1940	3	15	11	14800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  3  0  1  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,7

## ITERATION 250 #######################


> Neighbours evaluated; 70
> Selected Move:	1950	3	18	19	14300


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  3  0  0  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,75

## ITERATION 251 #######################


> Neighbours evaluated; 79
> Selected Move:	1950	3	8	4	14300


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  1  1  0  0  0  3  0  0  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,7

## ITERATION 252 #######################


> Neighbours evaluated; 72
> Selected Move:	1950	4	16	4	14900


> New Y[]: 
	
	 2  0  0  0  3  0  0  0  0  0  0  1  1  0  0  0  1  0  0  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,65

## ITERATION 253 #######################


> Neighbours evaluated; 51
> Selected Move:	1940	3	4	22	14800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  1  0  0  1  0  0  3  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,6

## ITERATION 254 #######################


> Neighbours evaluated; 62
> Selected Move:	1940	3	16	4	14300


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  1  1  0  0  0  0  0  0  1  0  0  3  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,55

## ITERATION 255 #######################


> Neighbours evaluated; 82
> Selected Move:	1940	3	12	8	14800


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  1  0  0  3  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,5

## ITERATION 256 #######################


> Neighbours evaluated; 70
> Selected Move:	1910	3	19	15	14800


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  3  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,45

## ITERATION 257 #######################


> Neighbours evaluated; 73
> Selected Move:	1920	3	22	12	14600


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  1  3  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,4

## ITERATION 258 #######################


> Neighbours evaluated; 77
> Selected Move:	1920	4	12	4	14400


> New Y[]: 
	
	 2  0  0  0  3  0  0  0  1  0  0  1  1  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,35

## ITERATION 259 #######################


> Neighbours evaluated; 101
> Selected Move:	1930	3	25	18	14900


> New Y[]: 
	
	 2  0  0  0  3  0  0  0  1  0  0  1  1  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,3

## ITERATION 260 #######################


> Neighbours evaluated; 80
> Selected Move:	1940	3	4	9	14800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  3  0  1  1  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,25

## ITERATION 261 #######################


> Neighbours evaluated; 97
> Selected Move:	1940	4	9	11	15000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  1  0  3  1  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,2

## ITERATION 262 #######################


> Neighbours evaluated; 107
> Selected Move:	1940	4	11	18	14800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  1  0  1  1  0  0  1  0  0  3  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,15

## ITERATION 263 #######################


> Neighbours evaluated; 128
> Selected Move:	1940	3	15	16	15800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  1  0  1  1  0  0  0  1  0  3  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,1

## ITERATION 264 #######################


> Neighbours evaluated; 103
> Selected Move:	2030	4	18	16	15300


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  1  0  1  1  0  0  0  3  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,15

## ITERATION 265 #######################


> Neighbours evaluated; 106
> Selected Move:	1995	3	9	4	15300


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  1  1  0  0  0  3  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,2

## ITERATION 266 #######################


> Neighbours evaluated; 89
> Selected Move:	1980	3	16	22	15300


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  1  1  0  0  0  0  0  1  0  0  0  3  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,25

## ITERATION 267 #######################


> Neighbours evaluated; 79
> Selected Move:	1940	3	4	15	14800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  0  1  1  0  0  1  0  0  1  0  0  0  3  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,3

## ITERATION 268 #######################


> Neighbours evaluated; 73
> Selected Move:	1940	3	15	25	14800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  1  0  0  0  3  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,35

## ITERATION 269 #######################


> Neighbours evaluated; 95
> Selected Move:	1930	3	22	10	14500


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  3  1  1  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,4

## ITERATION 270 #######################


> Neighbours evaluated; 100
> Selected Move:	1940	3	18	9	14500


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  1  3  1  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,45

## ITERATION 271 #######################


> Neighbours evaluated; 109
> Selected Move:	1930	3	25	15	14500


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  1  3  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,5

## ITERATION 272 #######################


> Neighbours evaluated; 105
> Selected Move:	1960	3	12	18	15000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  1  3  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,55

## ITERATION 273 #######################


> Neighbours evaluated; 59
> Selected Move:	1940	3	8	12	14500


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  3  1  1  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,6

## ITERATION 274 #######################


> Neighbours evaluated; 80
> Selected Move:	1940	3	9	3	15000


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  0  3  1  1  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,65

## ITERATION 275 #######################


> Neighbours evaluated; 42
> Selected Move:	1940	3	3	8	14500


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  3  1  1  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,6

## ITERATION 276 #######################


> Neighbours evaluated; 79
> Selected Move:	1940	3	8	16	15000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  3  1  1  0  0  1  1  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,55

## ITERATION 277 #######################


> Neighbours evaluated; 43
> Selected Move:	1940	3	10	3	15000


> New Y[]: 
	
	 2  0  0  3  0  0  0  0  0  0  0  1  1  0  0  1  1  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,5

## ITERATION 278 #######################


> Neighbours evaluated; 42
> Selected Move:	1930	3	16	4	14500


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  0  0  0  1  1  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,45

## ITERATION 279 #######################


> Neighbours evaluated; 90
> Selected Move:	1930	3	3	8	14600


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  3  0  0  1  1  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,4

## ITERATION 280 #######################


> Neighbours evaluated; 83
> Selected Move:	1930	4	8	11	15000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  3  1  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,35

## ITERATION 281 #######################


> Neighbours evaluated; 59
> Selected Move:	1940	3	11	10	15000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  3  0  1  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,3

## ITERATION 282 #######################


> Neighbours evaluated; 69
> Selected Move:	1940	3	12	11	15000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  3  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,25

## ITERATION 283 #######################


> Neighbours evaluated; 100
> Selected Move:	1940	3	18	12	14500


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  3  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,2

## ITERATION 284 #######################


> Neighbours evaluated; 128
> Selected Move:	1940	3	8	9	14500


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  1  3  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,15

## ITERATION 285 #######################


> Neighbours evaluated; 161
> Selected Move:	1945	3	15	3	15500


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  0  1  3  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,1

## ITERATION 286 #######################


> Neighbours evaluated; 126
> Selected Move:	2010	3	4	18	15500


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  1  3  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,15

## ITERATION 287 #######################


> Neighbours evaluated; 119
> Selected Move:	1965	3	10	24	15500


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  1  0  1  1  0  0  0  0  0  1  0  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,2

## ITERATION 288 #######################


> Neighbours evaluated; 57
> Selected Move:	2000	3	18	8	15500


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  1  1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 Penalty weight for next iteration :0,25

## ITERATION 289 #######################


> Neighbours evaluated; 80
> Selected Move:	1915	3	9	18	15500


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  1  0  0  1  1  0  0  0  0  0  1  0  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 Penalty weight for next iteration :0,3

## ITERATION 290 #######################


> Neighbours evaluated; 62
> Selected Move:	1910	3	18	15	15000


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  1  0  0  1  1  0  0  1  0  0  0  0  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 Penalty weight for next iteration :0,35

## ITERATION 291 #######################


> Neighbours evaluated; 68
> Selected Move:	1910	3	3	9	14500


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  1  0  1  1  0  0  1  0  0  0  0  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,4

## ITERATION 292 #######################


> Neighbours evaluated; 90
> Selected Move:	1930	3	24	6	14900


> New Y[]: 
	
	 2  0  0  0  0  0  3  0  1  1  0  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,45

## ITERATION 293 #######################


> Neighbours evaluated; 97
> Selected Move:	1920	3	8	18	14900


> New Y[]: 
	
	 2  0  0  0  0  0  3  0  0  1  0  1  1  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,5

## ITERATION 294 #######################


> Neighbours evaluated; 53
> Selected Move:	1940	3	6	21	14900


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  0  1  1  0  0  1  0  0  1  0  0  3  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,55

## ITERATION 295 #######################


> Neighbours evaluated; 41
> Selected Move:	1930	3	9	4	14900


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  1  1  0  0  1  0  0  1  0  0  3  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,6

## ITERATION 296 #######################


> Neighbours evaluated; 54
> Selected Move:	1930	3	21	10	14500


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  3  1  1  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,65

## ITERATION 297 #######################


> Neighbours evaluated; 93
> Selected Move:	1930	3	10	16	14800


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  1  1  0  0  1  3  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,7

## ITERATION 298 #######################


> Neighbours evaluated; 51
> Selected Move:	1940	3	4	8	14800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  0  1  1  0  0  1  3  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,65

## ITERATION 299 #######################


> Neighbours evaluated; 50
> Selected Move:	1940	3	18	4	14800


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  1  1  0  0  1  3  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,6

## ITERATION 300 #######################


> Neighbours evaluated; 59
> Selected Move:	1930	3	15	13	14800


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  1  1  1  0  0  3  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,55

## ITERATION 301 #######################


> Neighbours evaluated; 63
> Selected Move:	1930	3	11	25	14800


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  0  1  1  0  0  3  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,5

## ITERATION 302 #######################


> Neighbours evaluated; 50
> Selected Move:	1880	4	16	8	15100


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  3  0  0  0  1  1  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,45

## ITERATION 303 #######################


> Neighbours evaluated; 36
> Selected Move:	1885	3	25	11	15100


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  3  0  0  1  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,5

## ITERATION 304 #######################


> Neighbours evaluated; 60
> Selected Move:	1910	3	8	24	15000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  1  1  1  0  0  1  0  0  0  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,55

## ITERATION 305 #######################


> Neighbours evaluated; 36
> Selected Move:	1880	3	11	25	15000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  1  1  0  0  1  0  0  0  0  0  0  0  3  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,6

## ITERATION 306 #######################


> Neighbours evaluated; 25
> Selected Move:	1920	3	13	19	15000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  1  0  0  0  0  3  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,65

## ITERATION 307 #######################


> Neighbours evaluated; 35
> Selected Move:	1930	3	24	10	15000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  3  0  1  0  0  0  1  0  0  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,7

## ITERATION 308 #######################


> Neighbours evaluated; 43
> Selected Move:	1930	3	12	11	15000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  3  1  0  0  0  0  1  0  0  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,75

## ITERATION 309 #######################


> Neighbours evaluated; 54
> Selected Move:	1920	3	4	12	14500


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  3  1  1  0  0  0  1  0  0  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,8

## ITERATION 310 #######################


> Neighbours evaluated; 77
> Selected Move:	1920	3	16	4	14000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  3  1  1  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,85

## ITERATION 311 #######################


> Neighbours evaluated; 99
> Selected Move:	1920	3	0	16	15000


> New Y[]: 
	
	 0  0  0  0  1  0  0  0  0  0  3  1  1  0  0  0  2  0  0  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,9

## ITERATION 312 #######################


> Neighbours evaluated; 46
> Selected Move:	1890	3	10	8	15100


> New Y[]: 
	
	 0  0  0  0  1  0  0  0  3  0  0  1  1  0  0  0  2  0  0  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,95

## ITERATION 313 #######################


> Neighbours evaluated; 44
> Selected Move:	1885	3	11	15	15100


> New Y[]: 
	
	 0  0  0  0  1  0  0  0  3  0  0  0  1  0  0  1  2  0  0  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0 
 Penalty weight for next iteration :1

## ITERATION 314 #######################


> Neighbours evaluated; 20
> Selected Move:	1950	3	8	24	15000


> New Y[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  1  2  0  0  1  0  0  0  0  3  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1,05

## ITERATION 315 #######################


> Neighbours evaluated; 26
> Selected Move:	1950	3	4	8	15000


> New Y[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  1  2  0  0  1  0  0  0  0  3  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1,1

## ITERATION 316 #######################


> Neighbours evaluated; 23
> Selected Move:	1950	3	16	4	15000


> New Y[]: 
	
	 0  0  0  0  2  0  0  0  1  0  0  0  1  0  0  1  0  0  0  1  0  0  0  0  3  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1,15

## ITERATION 317 #######################


> Neighbours evaluated; 23
> Selected Move:	1920	3	4	5	15000


> New Y[]: 
	
	 0  0  0  0  0  2  0  0  1  0  0  0  1  0  0  1  0  0  0  1  0  0  0  0  3  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1,2

## ITERATION 318 #######################


> Neighbours evaluated; 42
> Selected Move:	1840	3	8	4	15000


> New Y[]: 
	
	 0  0  0  0  1  2  0  0  0  0  0  0  1  0  0  1  0  0  0  1  0  0  0  0  3  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 Penalty weight for next iteration :1,25

## ITERATION 319 #######################


> Neighbours evaluated; 24
> Selected Move:	1870	3	5	3	15000


> New Y[]: 
	
	 0  0  0  2  1  0  0  0  0  0  0  0  1  0  0  1  0  0  0  1  0  0  0  0  3  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1,3

## ITERATION 320 #######################


> Neighbours evaluated; 29
> Selected Move:	1920	3	25	11	15000


> New Y[]: 
	
	 0  0  0  2  1  0  0  0  0  0  0  1  1  0  0  1  0  0  0  1  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1,35

## ITERATION 321 #######################


> Neighbours evaluated; 25
> Selected Move:	1950	3	24	10	15000


> New Y[]: 
	
	 0  0  0  2  1  0  0  0  0  0  3  1  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1,4

## ITERATION 322 #######################


> Neighbours evaluated; 39
> Selected Move:	1890	3	4	18	15000


> New Y[]: 
	
	 0  0  0  2  0  0  0  0  0  0  3  1  1  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1,35

## ITERATION 323 #######################


> Neighbours evaluated; 25
> Selected Move:	1880	3	3	16	15000


> New Y[]: 
	
	 0  0  0  0  0  0  0  0  0  0  3  1  1  0  0  1  2  0  1  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1,3

## ITERATION 324 #######################


> Neighbours evaluated; 27
> Selected Move:	1890	3	10	3	15000


> New Y[]: 
	
	 0  0  0  3  0  0  0  0  0  0  0  1  1  0  0  1  2  0  1  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1,25

## ITERATION 325 #######################


> Neighbours evaluated; 29
> Selected Move:	1960	3	18	4	15000


> New Y[]: 
	
	 0  0  0  3  1  0  0  0  0  0  0  1  1  0  0  1  2  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1,2

## ITERATION 326 #######################


> Neighbours evaluated; 27
> Selected Move:	1930	3	11	25	15000


> New Y[]: 
	
	 0  0  0  3  1  0  0  0  0  0  0  0  1  0  0  1  2  0  0  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1,15

## ITERATION 327 #######################


> Neighbours evaluated; 32
> Selected Move:	1860	3	4	18	15000


> New Y[]: 
	
	 0  0  0  3  0  0  0  0  0  0  0  0  1  0  0  1  2  0  1  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1,1

## ITERATION 328 #######################


> Neighbours evaluated; 42
> Selected Move:	1850	3	3	17	15100


> New Y[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  2  3  1  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1,05

## ITERATION 329 #######################


> Neighbours evaluated; 48
> Selected Move:	1855	3	18	4	15100


> New Y[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  1  2  3  0  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1,1

## ITERATION 330 #######################


> Neighbours evaluated; 32
> Selected Move:	1840	3	17	10	15000


> New Y[]: 
	
	 0  0  0  0  1  0  0  0  0  0  3  0  1  0  0  1  2  0  0  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1,15

## ITERATION 331 #######################


> Neighbours evaluated; 39
> Selected Move:	1880	3	25	11	15000


> New Y[]: 
	
	 0  0  0  0  1  0  0  0  0  0  3  1  1  0  0  1  2  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1,2

## ITERATION 332 #######################


> Neighbours evaluated; 33
> Selected Move:	1920	3	10	24	15000


> New Y[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  1  1  0  0  1  2  0  0  1  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1,25

## ITERATION 333 #######################


> Neighbours evaluated; 23
> Selected Move:	1910	3	4	8	15000


> New Y[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  1  1  0  0  1  2  0  0  1  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 Penalty weight for next iteration :1,3

## ITERATION 334 #######################


> Neighbours evaluated; 26
> Selected Move:	1920	3	16	4	15000


> New Y[]: 
	
	 0  0  0  0  2  0  0  0  1  0  0  1  1  0  0  1  0  0  0  1  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1,35

## ITERATION 335 #######################


> Neighbours evaluated; 29
> Selected Move:	1870	3	4	3	15000


> New Y[]: 
	
	 0  0  0  2  0  0  0  0  1  0  0  1  1  0  0  1  0  0  0  1  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 Penalty weight for next iteration :1,4

## ITERATION 336 #######################


> Neighbours evaluated; 26
> Selected Move:	1840	3	3	0	14000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  0  1  1  0  0  1  0  0  0  1  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1,45

## ITERATION 337 #######################


> Neighbours evaluated; 81
> Selected Move:	1910	3	11	16	15000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  0  0  1  0  0  1  1  0  0  1  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 Penalty weight for next iteration :1,5

## ITERATION 338 #######################


> Neighbours evaluated; 30
> Selected Move:	1900	3	24	11	15000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  0  3  1  0  0  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1,45

## ITERATION 339 #######################


> Neighbours evaluated; 35
> Selected Move:	1900	4	11	8	14600


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  3  0  0  1  1  0  0  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1,4

## ITERATION 340 #######################


> Neighbours evaluated; 63
> Selected Move:	1900	4	8	16	14300


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  0  1  1  0  0  1  3  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1,35

## ITERATION 341 #######################


> Neighbours evaluated; 59
> Selected Move:	1920	3	15	2	14800


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  1  0  0  1  1  0  0  0  3  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1,3

## ITERATION 342 #######################


> Neighbours evaluated; 43
> Selected Move:	1920	3	8	4	14800


> New Y[]: 
	
	 2  0  1  0  1  0  0  0  0  0  0  1  1  0  0  0  3  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1,25

## ITERATION 343 #######################


> Neighbours evaluated; 42
> Selected Move:	1920	3	4	9	14800


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  0  1  0  1  1  0  0  0  3  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1,2

## ITERATION 344 #######################


> Neighbours evaluated; 44
> Selected Move:	1890	3	2	18	14800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  0  1  1  0  0  0  3  0  1  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1,15

## ITERATION 345 #######################


> Neighbours evaluated; 54
> Selected Move:	1890	3	9	8	14800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  3  0  1  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1,1

## ITERATION 346 #######################


> Neighbours evaluated; 58
> Selected Move:	1900	3	18	29	14800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  3  0  0  1  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1,05

## ITERATION 347 #######################


> Neighbours evaluated; 63
> Selected Move:	1920	3	19	25	14800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  3  0  0  0  0  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1

## ITERATION 348 #######################


> Neighbours evaluated; 67
> Selected Move:	1870	3	16	10	14500


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  3  1  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,95

## ITERATION 349 #######################


> Neighbours evaluated; 78
> Selected Move:	1940	3	25	18	15000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  3  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,9

## ITERATION 350 #######################


> Neighbours evaluated; 45
> Selected Move:	1910	3	10	3	15000


> New Y[]: 
	
	 2  0  0  3  0  0  0  0  1  0  0  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,85

## ITERATION 351 #######################


> Neighbours evaluated; 53
> Selected Move:	1930	3	29	2	15000


> New Y[]: 
	
	 2  0  1  3  0  0  0  0  1  0  0  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,8

## ITERATION 352 #######################


> Neighbours evaluated; 34
> Selected Move:	1940	3	18	9	15000


> New Y[]: 
	
	 2  0  1  3  0  0  0  0  1  1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,75

## ITERATION 353 #######################


> Neighbours evaluated; 46
> Selected Move:	1920	3	2	29	15000


> New Y[]: 
	
	 2  0  0  3  0  0  0  0  1  1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,7

## ITERATION 354 #######################


> Neighbours evaluated; 60
> Selected Move:	1910	3	8	18	15000


> New Y[]: 
	
	 2  0  0  3  0  0  0  0  0  1  0  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,65

## ITERATION 355 #######################


> Neighbours evaluated; 52
> Selected Move:	1890	3	29	19	14500


> New Y[]: 
	
	 2  0  0  3  0  0  0  0  0  1  0  1  1  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,6

## ITERATION 356 #######################


> Neighbours evaluated; 77
> Selected Move:	1920	3	11	8	15000


> New Y[]: 
	
	 2  0  0  3  0  0  0  0  1  1  0  0  1  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,55

## ITERATION 357 #######################


> Neighbours evaluated; 54
> Selected Move:	1920	3	3	10	15000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  1  3  0  1  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,5

## ITERATION 358 #######################


> Neighbours evaluated; 61
> Selected Move:	1930	3	19	15	15000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  1  3  0  1  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,45

## ITERATION 359 #######################


> Neighbours evaluated; 52
> Selected Move:	1910	3	15	25	15000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  1  3  0  1  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,4

## ITERATION 360 #######################


> Neighbours evaluated; 73
> Selected Move:	1900	3	9	4	15000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  3  0  1  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,35

## ITERATION 361 #######################


> Neighbours evaluated; 71
> Selected Move:	1930	3	8	2	15000


> New Y[]: 
	
	 2  0  1  0  1  0  0  0  0  0  3  0  1  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,3

## ITERATION 362 #######################


> Neighbours evaluated; 76
> Selected Move:	1910	3	2	15	14500


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  3  0  1  0  0  1  0  0  1  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,25

## ITERATION 363 #######################


> Neighbours evaluated; 125
> Selected Move:	1920	3	18	11	14000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  3  1  1  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,2

## ITERATION 364 #######################


> Neighbours evaluated; 165
> Selected Move:	1950	3	15	22	15500


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  3  1  1  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,15

## ITERATION 365 #######################


> Neighbours evaluated; 114
> Selected Move:	1960	3	10	8	15600


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  3  0  0  1  1  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,2

## ITERATION 366 #######################


> Neighbours evaluated; 82
> Selected Move:	1920	3	4	19	15100


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  3  0  0  1  1  0  0  0  0  0  0  1  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,25

## ITERATION 367 #######################


> Neighbours evaluated; 88
> Selected Move:	1900	3	8	10	15000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  3  1  1  0  0  0  0  0  0  1  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,3

## ITERATION 368 #######################


> Neighbours evaluated; 81
> Selected Move:	1870	3	19	15	15000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  3  1  1  0  0  1  0  0  0  0  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,35

## ITERATION 369 #######################


> Neighbours evaluated; 79
> Selected Move:	1870	3	10	24	15000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  1  1  0  0  1  0  0  0  0  0  0  1  0  3  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 Penalty weight for next iteration :0,4

## ITERATION 370 #######################


> Neighbours evaluated; 70
> Selected Move:	1870	3	22	4	14000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  1  1  0  0  1  0  0  0  0  0  0  0  0  3  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,45

## ITERATION 371 #######################


> Neighbours evaluated; 101
> Selected Move:	1940	3	15	2	14500


> New Y[]: 
	
	 2  0  1  0  1  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  3  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,5

## ITERATION 372 #######################


> Neighbours evaluated; 70
> Selected Move:	1940	3	4	16	15000


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  0  0  0  1  1  0  0  0  1  0  0  0  0  0  0  0  3  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,55

## ITERATION 373 #######################


> Neighbours evaluated; 64
> Selected Move:	1905	3	24	8	15100


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  3  0  0  1  1  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,6

## ITERATION 374 #######################


> Neighbours evaluated; 44
> Selected Move:	1880	3	2	18	15100


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  3  0  0  1  1  0  0  0  1  0  1  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,65

## ITERATION 375 #######################


> Neighbours evaluated; 62
> Selected Move:	1875	3	11	15	15100


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  3  0  0  0  1  0  0  1  1  0  1  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,7

## ITERATION 376 #######################


> Neighbours evaluated; 40
> Selected Move:	1910	3	16	4	14600


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  3  0  0  0  1  0  0  1  0  0  1  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,75

## ITERATION 377 #######################


> Neighbours evaluated; 52
> Selected Move:	1920	3	18	11	14100


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  3  0  0  1  1  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,8

## ITERATION 378 #######################


> Neighbours evaluated; 91
> Selected Move:	1920	4	8	11	14500


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  3  1  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,85

## ITERATION 379 #######################


> Neighbours evaluated; 63
> Selected Move:	1920	4	11	15	14600


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  1  1  0  0  3  0  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,9

## ITERATION 380 #######################


> Neighbours evaluated; 72
> Selected Move:	1900	3	25	19	14600


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  1  1  0  0  3  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,95

## ITERATION 381 #######################


> Neighbours evaluated; 64
> Selected Move:	1900	4	15	4	14400


> New Y[]: 
	
	 2  0  0  0  3  0  0  0  1  0  0  1  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1

## ITERATION 382 #######################


> Neighbours evaluated; 64
> Selected Move:	1900	4	4	8	14100


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  3  0  0  1  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1,05

## ITERATION 383 #######################


> Neighbours evaluated; 91
> Selected Move:	1900	4	8	11	14500


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  3  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1,1

## ITERATION 384 #######################


> Neighbours evaluated; 65
> Selected Move:	1900	4	11	12	14600


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  1  3  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1,05

## ITERATION 385 #######################


> Neighbours evaluated; 67
> Selected Move:	1900	4	12	19	14900


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  1  1  0  0  1  0  0  0  3  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :1

## ITERATION 386 #######################


> Neighbours evaluated; 44
> Selected Move:	1930	3	19	18	14800


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  1  1  0  0  1  0  0  3  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,95

## ITERATION 387 #######################


> Neighbours evaluated; 51
> Selected Move:	1910	3	11	25	14800


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  0  1  0  0  1  0  0  3  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,9

## ITERATION 388 #######################


> Neighbours evaluated; 43
> Selected Move:	1910	4	18	4	14900


> New Y[]: 
	
	 2  0  0  0  3  0  0  0  1  0  0  0  1  0  0  1  0  0  1  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,85

## ITERATION 389 #######################


> Neighbours evaluated; 42
> Selected Move:	1910	3	4	22	14800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  0  0  1  0  0  1  0  0  1  0  0  0  3  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,8

## ITERATION 390 #######################


> Neighbours evaluated; 38
> Selected Move:	1910	3	8	4	14800


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  1  0  0  1  0  0  1  0  0  0  3  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,75

## ITERATION 391 #######################


> Neighbours evaluated; 43
> Selected Move:	1930	3	25	11	14800


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  1  1  0  0  1  0  0  1  0  0  0  3  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,7

## ITERATION 392 #######################


> Neighbours evaluated; 49
> Selected Move:	1890	3	18	19	14300


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  1  1  0  0  1  0  0  0  1  0  0  3  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,65

## ITERATION 393 #######################


> Neighbours evaluated; 74
> Selected Move:	1920	3	15	9	14800


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  1  0  1  1  0  0  0  0  0  0  1  0  0  3  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,6

## ITERATION 394 #######################


> Neighbours evaluated; 47
> Selected Move:	1920	3	4	8	14800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  1  0  1  1  0  0  0  0  0  0  1  0  0  3  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,55

## ITERATION 395 #######################


> Neighbours evaluated; 70
> Selected Move:	1900	3	11	15	14800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  1  0  0  1  0  0  1  0  0  0  1  0  0  3  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,5

## ITERATION 396 #######################


> Neighbours evaluated; 68
> Selected Move:	1930	3	22	5	14600


> New Y[]: 
	
	 2  0  0  0  0  3  0  0  1  1  0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,45

## ITERATION 397 #######################


> Neighbours evaluated; 104
> Selected Move:	1910	3	5	16	14800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  1  0  0  1  0  0  1  3  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,4

## ITERATION 398 #######################


> Neighbours evaluated; 60
> Selected Move:	1910	3	12	11	14800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  1  0  1  0  0  0  1  3  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,35

## ITERATION 399 #######################


> Neighbours evaluated; 73
> Selected Move:	1915	3	15	4	15300


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  1  0  1  0  0  0  0  3  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,3

## ITERATION 400 #######################


> Neighbours evaluated; 78
> Selected Move:	1940	3	19	12	15300


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  1  0  1  1  0  0  0  3  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,35

## ITERATION 401 #######################


> Neighbours evaluated; 56
> Selected Move:	1935	3	9	2	15300


> New Y[]: 
	
	 2  0  1  0  1  0  0  0  1  0  0  1  1  0  0  0  3  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,4

## ITERATION 402 #######################


> Neighbours evaluated; 46
> Selected Move:	1910	3	4	9	15300


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  1  1  0  1  1  0  0  0  3  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,45

## ITERATION 403 #######################


> Neighbours evaluated; 52
> Selected Move:	1905	3	16	5	15100


> New Y[]: 
	
	 2  0  1  0  0  3  0  0  1  1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,5

## ITERATION 404 #######################


> Neighbours evaluated; 56
> Selected Move:	1910	3	2	15	14600


> New Y[]: 
	
	 2  0  0  0  0  3  0  0  1  1  0  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,55

## ITERATION 405 #######################


> Neighbours evaluated; 96
> Selected Move:	1900	3	5	3	14500


> New Y[]: 
	
	 2  0  0  3  0  0  0  0  1  1  0  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,6

## ITERATION 406 #######################


> Neighbours evaluated; 70
> Selected Move:	1930	3	8	4	14500


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  0  1  0  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,65

## ITERATION 407 #######################


> Neighbours evaluated; 77
> Selected Move:	1910	3	3	24	14500


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  1  0  1  1  0  0  1  0  0  0  0  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,7

## ITERATION 408 #######################


> Neighbours evaluated; 61
> Selected Move:	1910	3	4	3	15000


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  1  0  1  1  0  0  1  0  0  0  0  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,75

## ITERATION 409 #######################


> Neighbours evaluated; 40
> Selected Move:	1930	3	24	10	15000


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  1  3  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,8

## ITERATION 410 #######################


> Neighbours evaluated; 45
> Selected Move:	1890	3	3	16	15000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  3  1  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,85

## ITERATION 411 #######################


> Neighbours evaluated; 39
> Selected Move:	1890	3	10	3	15000


> New Y[]: 
	
	 2  0  0  3  0  0  0  0  0  1  0  1  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,9

## ITERATION 412 #######################


> Neighbours evaluated; 35
> Selected Move:	1910	3	11	19	15000


> New Y[]: 
	
	 2  0  0  3  0  0  0  0  0  1  0  0  1  0  0  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,85

## ITERATION 413 #######################


> Neighbours evaluated; 33
> Selected Move:	1910	3	9	4	15000


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  0  0  0  0  1  0  0  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,8

## ITERATION 414 #######################


> Neighbours evaluated; 32
> Selected Move:	1920	3	19	25	15000


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,75

## ITERATION 415 #######################


> Neighbours evaluated; 29
> Selected Move:	1900	3	3	11	15000


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  3  1  0  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,7

## ITERATION 416 #######################


> Neighbours evaluated; 37
> Selected Move:	1900	4	11	4	14900


> New Y[]: 
	
	 2  0  0  0  3  0  0  0  0  0  0  1  1  0  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,65

## ITERATION 417 #######################


> Neighbours evaluated; 47
> Selected Move:	1900	4	4	16	14300


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  1  1  0  0  1  3  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,6

## ITERATION 418 #######################


> Neighbours evaluated; 69
> Selected Move:	1910	3	11	18	14800


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  1  0  0  1  3  0  1  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,55

## ITERATION 419 #######################


> Neighbours evaluated; 49
> Selected Move:	1900	3	16	6	14900


> New Y[]: 
	
	 2  0  0  0  1  0  3  0  0  0  0  0  1  0  0  1  0  0  1  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,5

## ITERATION 420 #######################


> Neighbours evaluated; 43
> Selected Move:	1900	3	18	8	14900


> New Y[]: 
	
	 2  0  0  0  1  0  3  0  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,45

## ITERATION 421 #######################


> Neighbours evaluated; 59
> Selected Move:	1910	3	6	22	14800


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  0  1  0  0  1  0  0  0  0  0  0  3  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,4

## ITERATION 422 #######################


> Neighbours evaluated; 57
> Selected Move:	1900	3	22	27	14700


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  1  0  3  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,35

## ITERATION 423 #######################


> Neighbours evaluated; 79
> Selected Move:	1920	3	15	2	15200


> New Y[]: 
	
	 2  0  1  0  1  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  3  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,3

## ITERATION 424 #######################


> Neighbours evaluated; 50
> Selected Move:	1930	3	27	17	15100


> New Y[]: 
	
	 2  0  1  0  1  0  0  0  1  0  0  0  1  0  0  0  0  3  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,35

## ITERATION 425 #######################


> Neighbours evaluated; 38
> Selected Move:	1945	3	4	18	15100


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  1  0  0  0  1  0  0  0  0  3  1  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,4

## ITERATION 426 #######################


> Neighbours evaluated; 57
> Selected Move:	1890	3	25	11	15100


> New Y[]: 
	
	 2  0  1  0  0  0  0  0  1  0  0  1  1  0  0  0  0  3  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,45

## ITERATION 427 #######################


> Neighbours evaluated; 53
> Selected Move:	1910	3	2	15	14600


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  0  1  1  0  0  1  0  3  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,5

## ITERATION 428 #######################


> Neighbours evaluated; 69
> Selected Move:	1920	3	17	6	14900


> New Y[]: 
	
	 2  0  0  0  0  0  3  0  1  0  0  1  1  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,55

## ITERATION 429 #######################


> Neighbours evaluated; 57
> Selected Move:	1910	3	6	3	14500


> New Y[]: 
	
	 2  0  0  3  0  0  0  0  1  0  0  1  1  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,6

## ITERATION 430 #######################


> Neighbours evaluated; 55
> Selected Move:	1910	3	12	9	15000


> New Y[]: 
	
	 2  0  0  3  0  0  0  0  1  1  0  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,65

## ITERATION 431 #######################


> Neighbours evaluated; 62
> Selected Move:	1920	3	3	24	15000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  1  0  1  0  0  0  1  0  0  1  0  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,7

## ITERATION 432 #######################


> Neighbours evaluated; 51
> Selected Move:	1910	3	8	12	14500


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  0  1  1  0  0  1  0  0  1  0  0  0  0  0  3  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,75

## ITERATION 433 #######################


> Neighbours evaluated; 47
> Selected Move:	1900	3	24	17	14600


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  0  1  1  0  0  1  0  3  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,8

## ITERATION 434 #######################


> Neighbours evaluated; 51
> Selected Move:	1900	3	18	4	14600


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  1  0  1  1  0  0  1  0  3  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,85

## ITERATION 435 #######################


> Neighbours evaluated; 57
> Selected Move:	1900	3	4	8	14600


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  1  0  1  1  0  0  1  0  3  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,8

## ITERATION 436 #######################


> Neighbours evaluated; 65
> Selected Move:	1900	3	11	19	14600


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  1  0  0  1  0  0  1  0  3  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,75

## ITERATION 437 #######################


> Neighbours evaluated; 61
> Selected Move:	1870	3	17	11	14500


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  1  0  3  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,7

## ITERATION 438 #######################


> Neighbours evaluated; 73
> Selected Move:	1890	3	15	18	15000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  1  0  3  1  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,65

## ITERATION 439 #######################


> Neighbours evaluated; 61
> Selected Move:	1890	4	11	8	14600


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  3  1  0  1  1  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,6

## ITERATION 440 #######################


> Neighbours evaluated; 79
> Selected Move:	1890	4	8	9	14800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  3  0  1  1  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,55

## ITERATION 441 #######################


> Neighbours evaluated; 68
> Selected Move:	1890	4	9	18	14800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  1  0  1  1  0  0  0  0  0  3  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,5

## ITERATION 442 #######################


> Neighbours evaluated; 64
> Selected Move:	1890	3	18	1	13500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,45

## ITERATION 443 #######################


> Neighbours evaluated; 127
> Selected Move:	1920	3	8	24	15000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  1  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,4

## ITERATION 444 #######################


> Neighbours evaluated; 59
> Selected Move:	1940	3	9	4	15000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  1  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,35

## ITERATION 445 #######################


> Neighbours evaluated; 66
> Selected Move:	1960	3	19	25	15000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 Penalty weight for next iteration :0,3

## ITERATION 446 #######################


> Neighbours evaluated; 95
> Selected Move:	1880	3	24	6	15000


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,25

## ITERATION 447 #######################


> Neighbours evaluated; 104
> Selected Move:	1870	3	6	17	14500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,2

## ITERATION 448 #######################


> Neighbours evaluated; 135
> Selected Move:	1940	3	25	16	15500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  1  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,15

## ITERATION 449 #######################


> Neighbours evaluated; 95
> Selected Move:	1985	3	4	9	15500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  1  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,2

## ITERATION 450 #######################


> Neighbours evaluated; 99
> Selected Move:	1910	3	16	8	15000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  0  1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,25

## ITERATION 451 #######################


> Neighbours evaluated; 107
> Selected Move:	1920	3	17	10	15000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,3

## ITERATION 452 #######################


> Neighbours evaluated; 71
> Selected Move:	1960	3	8	18	15000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  1  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,35

## ITERATION 453 #######################


> Neighbours evaluated; 82
> Selected Move:	1920	3	9	4	15000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  1  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,4

## ITERATION 454 #######################


> Neighbours evaluated; 89
> Selected Move:	1920	3	10	16	14500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  1  1  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,45

## ITERATION 455 #######################


> Neighbours evaluated; 100
> Selected Move:	1920	3	4	3	15000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  1  1  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,5

## ITERATION 456 #######################


> Neighbours evaluated; 53
> Selected Move:	1920	3	3	8	14500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  1  1  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,55

## ITERATION 457 #######################


> Neighbours evaluated; 78
> Selected Move:	1940	3	12	9	15000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  0  1  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,6

## ITERATION 458 #######################


> Neighbours evaluated; 39
> Selected Move:	1920	3	11	12	15000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,55

## ITERATION 459 #######################


> Neighbours evaluated; 39
> Selected Move:	1920	3	16	11	14000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  0  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,5

## ITERATION 460 #######################


> Neighbours evaluated; 98
> Selected Move:	1970	3	0	16	15000


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  1  1  0  1  1  0  0  0  2  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,45

## ITERATION 461 #######################


> Neighbours evaluated; 57
> Selected Move:	1950	3	8	4	15000


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  1  0  1  1  0  0  0  2  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,4

## ITERATION 462 #######################


> Neighbours evaluated; 56
> Selected Move:	1940	3	4	2	15000


> New Y[]: 
	
	 0  3  1  0  0  0  0  0  0  1  0  1  1  0  0  0  2  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,35

## ITERATION 463 #######################


> Neighbours evaluated; 62
> Selected Move:	1920	3	9	4	15000


> New Y[]: 
	
	 0  3  1  0  1  0  0  0  0  0  0  1  1  0  0  0  2  0  1  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,3

## ITERATION 464 #######################


> Neighbours evaluated; 80
> Selected Move:	1920	3	16	28	15000


> New Y[]: 
	
	 0  3  1  0  1  0  0  0  0  0  0  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  2  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,25

## ITERATION 465 #######################


> Neighbours evaluated; 64
> Selected Move:	1920	3	2	9	15000


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  1  0  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  2  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,2

## ITERATION 466 #######################


> Neighbours evaluated; 82
> Selected Move:	1920	3	4	2	15000


> New Y[]: 
	
	 0  3  1  0  0  0  0  0  0  1  0  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  2  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,15

## ITERATION 467 #######################


> Neighbours evaluated; 108
> Selected Move:	1925	3	28	24	15100


> New Y[]: 
	
	 0  3  1  0  0  0  0  0  0  1  0  1  1  0  0  0  0  0  1  0  0  0  0  0  2  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 Penalty weight for next iteration :0,1

## ITERATION 468 #######################


> Neighbours evaluated; 84
> Selected Move:	2010	3	18	16	15600


> New Y[]: 
	
	 0  3  1  0  0  0  0  0  0  1  0  1  1  0  0  0  1  0  0  0  0  0  0  0  2  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 Penalty weight for next iteration :0,15

## ITERATION 469 #######################


> Neighbours evaluated; 61
> Selected Move:	1970	3	2	8	15600


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  1  1  0  1  1  0  0  0  1  0  0  0  0  0  0  0  2  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 Penalty weight for next iteration :0,2

## ITERATION 470 #######################


> Neighbours evaluated; 59
> Selected Move:	1980	3	16	4	15100


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  1  1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  2  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 Penalty weight for next iteration :0,25

## ITERATION 471 #######################


> Neighbours evaluated; 78
> Selected Move:	1945	3	4	18	15100


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  1  1  0  1  1  0  0  0  0  0  1  0  0  0  0  0  2  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 Penalty weight for next iteration :0,3

## ITERATION 472 #######################


> Neighbours evaluated; 76
> Selected Move:	1920	3	24	28	15000


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  1  1  0  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  2  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,35

## ITERATION 473 #######################


> Neighbours evaluated; 86
> Selected Move:	1890	3	11	15	15000


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  1  1  0  0  1  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  2  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,4

## ITERATION 474 #######################


> Neighbours evaluated; 56
> Selected Move:	1860	3	15	19	15000


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  1  1  0  0  1  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  2  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,45

## ITERATION 475 #######################


> Neighbours evaluated; 78
> Selected Move:	1860	3	18	4	15000


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  1  1  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  2  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,5

## ITERATION 476 #######################


> Neighbours evaluated; 50
> Selected Move:	1880	3	9	11	14500


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  1  0  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  2  0 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,55

## ITERATION 477 #######################


> Neighbours evaluated; 81
> Selected Move:	1930	3	28	22	14800


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  1  0  0  1  1  0  0  0  0  0  0  1  0  0  2  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,6

## ITERATION 478 #######################


> Neighbours evaluated; 48
> Selected Move:	1920	3	19	25	14800


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  2  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,65

## ITERATION 479 #######################


> Neighbours evaluated; 56
> Selected Move:	1920	3	22	16	14500


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  1  0  0  1  1  0  0  0  2  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,7

## ITERATION 480 #######################


> Neighbours evaluated; 60
> Selected Move:	1920	4	16	4	15000


> New Y[]: 
	
	 0  3  0  0  2  0  0  0  1  0  0  1  1  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,65

## ITERATION 481 #######################


> Neighbours evaluated; 48
> Selected Move:	1930	3	25	19	15000


> New Y[]: 
	
	 0  3  0  0  2  0  0  0  1  0  0  1  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,6

## ITERATION 482 #######################


> Neighbours evaluated; 44
> Selected Move:	1900	3	8	15	14500


> New Y[]: 
	
	 0  3  0  0  2  0  0  0  0  0  0  1  1  0  0  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,55

## ITERATION 483 #######################


> Neighbours evaluated; 69
> Selected Move:	1900	4	4	11	15000


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  0  0  2  1  0  0  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,5

## ITERATION 484 #######################


> Neighbours evaluated; 42
> Selected Move:	1900	4	11	16	14000


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  0  0  1  1  0  0  1  2  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,45

## ITERATION 485 #######################


> Neighbours evaluated; 87
> Selected Move:	1900	4	16	19	15000


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  0  0  1  1  0  0  1  1  0  0  2  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,4

## ITERATION 486 #######################


> Neighbours evaluated; 46
> Selected Move:	1920	3	19	17	15100


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  0  0  1  1  0  0  1  1  2  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,35

## ITERATION 487 #######################


> Neighbours evaluated; 51
> Selected Move:	1905	3	15	19	15100


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  0  0  1  1  0  0  0  1  2  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,4

## ITERATION 488 #######################


> Neighbours evaluated; 54
> Selected Move:	1930	3	4	9	15100


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  1  1  0  0  0  1  2  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,45

## ITERATION 489 #######################


> Neighbours evaluated; 67
> Selected Move:	1980	3	17	21	15000


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  0  1  0  1  1  0  0  0  1  0  0  1  0  2  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,5

## ITERATION 490 #######################


> Neighbours evaluated; 62
> Selected Move:	1930	3	21	5	15000


> New Y[]: 
	
	 0  3  0  0  0  2  0  0  0  1  0  1  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,55

## ITERATION 491 #######################


> Neighbours evaluated; 44
> Selected Move:	1930	3	5	7	15000


> New Y[]: 
	
	 0  3  0  0  0  0  0  2  0  1  0  1  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,6

## ITERATION 492 #######################


> Neighbours evaluated; 40
> Selected Move:	1890	3	7	2	15000


> New Y[]: 
	
	 0  3  2  0  0  0  0  0  0  1  0  1  1  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,65

## ITERATION 493 #######################


> Neighbours evaluated; 46
> Selected Move:	1890	4	2	16	14500


> New Y[]: 
	
	 0  3  1  0  0  0  0  0  0  1  0  1  1  0  0  0  2  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,7

## ITERATION 494 #######################


> Neighbours evaluated; 64
> Selected Move:	1910	3	11	8	15000


> New Y[]: 
	
	 0  3  1  0  0  0  0  0  1  1  0  0  1  0  0  0  2  0  0  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,75

## ITERATION 495 #######################


> Neighbours evaluated; 41
> Selected Move:	1930	3	19	25	15000


> New Y[]: 
	
	 0  3  1  0  0  0  0  0  1  1  0  0  1  0  0  0  2  0  0  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,8

## ITERATION 496 #######################


> Neighbours evaluated; 45
> Selected Move:	1910	3	2	18	15000


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  1  1  0  0  1  0  0  0  2  0  1  0  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,85

## ITERATION 497 #######################


> Neighbours evaluated; 50
> Selected Move:	1900	3	18	19	14500


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  1  1  0  0  1  0  0  0  2  0  0  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,8

## ITERATION 498 #######################


> Neighbours evaluated; 67
> Selected Move:	1900	3	16	5	14500


> New Y[]: 
	
	 0  3  0  0  0  2  0  0  1  1  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,75

## ITERATION 499 #######################


> Neighbours evaluated; 91
> Selected Move:	1930	3	9	16	15000


> New Y[]: 
	
	 0  3  0  0  0  2  0  0  1  0  0  0  1  0  0  0  1  0  0  1  0  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 Penalty weight for next iteration :0,7
________________________________________________________________

Best solution found: 2090
Run Termination time: 21.01.2010 14:42:10
Run duration: 00:05:14.2159721
________________________________________________________________
